Asymptotic capacity of two-dimensional channels with checkerboard constraints

A checkerboard constraint is a bounded measurable set 2, containing the origin. A binary labeling of the 2 lattice satisfies the checkerboard constraint if whenever 2 is labeled 1, all of the other 2-lattice points in the translate + are labeled 0. Two-dimensional channels that only allow labelings of 2 satisfying checkerboard constraints are studied. Let ( ) be the area of , and let ( ) mean that retains its shape but is inflated in size in the form , as . It is shown that for any open checkerboard constraint , there exist positive reals 1 and 2 such that as ( ) , the channel capacity decays to zero at least as fast as ( 1 log2 ( )) ( ) and at most as fast as ( 2 log2 ( )) ( ). It is also shown that if is an open convex and symmetric checkerboard constraint, then as ( ) , the capacity decays exactly at the rate 4 ( )(log 2 ( )) ( ), where ( ) is the packing density of the set . An implication is that the capacity of such checkerboard constrained channels is asymptotically determined only by the areas of the constraint and the smallest (possibly degenerate) hexagon that can be circumscribed about the constraint. In particular, this establishes that channels with square, diamond, or hexagonal checkerboard constraints all asymptotically have the same capacity, since ( ) = 1 for such constraints.